TSTP Solution File: ITP080^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : ITP080^1 : TPTP v8.1.2. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n025.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sat May 4 08:06:53 EDT 2024
% Result : Theorem 0.45s 0.80s
% Output : CNFRefutation 0.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 33
% Syntax : Number of formulae : 48 ( 7 unt; 27 typ; 0 def)
% Number of atoms : 41 ( 4 equ; 0 cnn)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 165 ( 11 ~; 6 |; 0 &; 144 @)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 8 avg)
% Number of types : 10 ( 9 usr)
% Number of type conns : 47 ( 47 >; 0 *; 0 +; 0 <<)
% Number of symbols : 20 ( 18 usr; 5 con; 0-7 aty)
% Number of variables : 22 ( 0 ^ 22 !; 0 ?; 22 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
set_node: $tType ).
thf(decl_sort2,type,
set_val: $tType ).
thf(decl_sort3,type,
g: $tType ).
thf(decl_sort4,type,
list_node: $tType ).
thf(decl_sort5,type,
node: $tType ).
thf(decl_sort6,type,
list_P561207620_edgeD: $tType ).
thf(decl_sort7,type,
val: $tType ).
thf(decl_sort8,type,
produc1432036078de_val: $tType ).
thf(decl_sort9,type,
option_list_val: $tType ).
thf(decl_24,type,
graph_1994935542_edgeD: ( g > list_node ) > ( g > $o ) > ( g > node > list_P561207620_edgeD ) > ( g > node ) > g > list_node > $o ).
thf(decl_28,type,
graph_1012773594_edgeD: ( g > list_node ) > ( g > $o ) > ( g > node > list_P561207620_edgeD ) > g > node > list_node > node > $o ).
thf(decl_34,type,
distinct_node: list_node > $o ).
thf(decl_47,type,
hd_node: list_node > node ).
thf(decl_50,type,
set_node2: list_node > set_node ).
thf(decl_53,type,
tl_node: list_node > list_node ).
thf(decl_60,type,
sSA_CF551432799de_val: ( g > list_node ) > ( g > node > set_val ) > ( g > produc1432036078de_val > option_list_val ) > g > val > node ).
thf(decl_68,type,
member_node: node > set_node > $o ).
thf(decl_70,type,
entry: g > node ).
thf(decl_71,type,
alpha_n: g > list_node ).
thf(decl_73,type,
defs: g > node > set_val ).
thf(decl_74,type,
g2: g ).
thf(decl_75,type,
inEdges: g > node > list_P561207620_edgeD ).
thf(decl_76,type,
invar: g > $o ).
thf(decl_81,type,
phis: g > produc1432036078de_val > option_list_val ).
thf(decl_82,type,
pred_phi_r: node ).
thf(decl_83,type,
r: val ).
thf(decl_84,type,
rs: list_node ).
thf(fact_0_old_Opath2__hd,axiom,
! [X1: g,X2: node,X3: list_node,X4: node] :
( ( graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ X1 @ X2 @ X3 @ X4 )
=> ( X2
= ( hd_node @ X3 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.mOZHZfEMMT/E---3.1_20101.p',fact_0_old_Opath2__hd) ).
thf(fact_30_FormalSSA__Misc_Odistinct__hd__tl,axiom,
! [X17: list_node] :
( ( distinct_node @ X17 )
=> ~ ( member_node @ ( hd_node @ X17 ) @ ( set_node2 @ ( tl_node @ X17 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.mOZHZfEMMT/E---3.1_20101.p',fact_30_FormalSSA__Misc_Odistinct__hd__tl) ).
thf(conj_0,conjecture,
~ ( member_node @ ( sSA_CF551432799de_val @ alpha_n @ defs @ phis @ g2 @ r ) @ ( set_node2 @ ( tl_node @ rs ) ) ),
file('/export/starexec/sandbox/tmp/tmp.mOZHZfEMMT/E---3.1_20101.p',conj_0) ).
thf(fact_4_rs_H__props_I1_J,axiom,
graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ g2 @ ( sSA_CF551432799de_val @ alpha_n @ defs @ phis @ g2 @ r ) @ rs @ pred_phi_r,
file('/export/starexec/sandbox/tmp/tmp.mOZHZfEMMT/E---3.1_20101.p',fact_4_rs_H__props_I1_J) ).
thf(fact_5_old_OEntryPath__distinct,axiom,
! [X1: g,X3: list_node] :
( ( graph_1994935542_edgeD @ alpha_n @ invar @ inEdges @ entry @ X1 @ X3 )
=> ( distinct_node @ X3 ) ),
file('/export/starexec/sandbox/tmp/tmp.mOZHZfEMMT/E---3.1_20101.p',fact_5_old_OEntryPath__distinct) ).
thf(fact_3_rs_H__props_I2_J,axiom,
graph_1994935542_edgeD @ alpha_n @ invar @ inEdges @ entry @ g2 @ rs,
file('/export/starexec/sandbox/tmp/tmp.mOZHZfEMMT/E---3.1_20101.p',fact_3_rs_H__props_I2_J) ).
thf(c_0_6,plain,
! [X2906: g,X2907: node,X2908: list_node,X2909: node] :
( ~ ( graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ X2906 @ X2907 @ X2908 @ X2909 )
| ( X2907
= ( hd_node @ X2908 ) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_0_old_Opath2__hd])])]) ).
thf(c_0_7,plain,
! [X17: list_node] :
( ( distinct_node @ X17 )
=> ~ ( member_node @ ( hd_node @ X17 ) @ ( set_node2 @ ( tl_node @ X17 ) ) ) ),
inference(fof_simplification,[status(thm)],[fact_30_FormalSSA__Misc_Odistinct__hd__tl]) ).
thf(c_0_8,negated_conjecture,
member_node @ ( sSA_CF551432799de_val @ alpha_n @ defs @ phis @ g2 @ r ) @ ( set_node2 @ ( tl_node @ rs ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])]) ).
thf(c_0_9,plain,
! [X3: list_node,X2: node,X1: g,X4: node] :
( ( X2
= ( hd_node @ X3 ) )
| ~ ( graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ X1 @ X2 @ X3 @ X4 ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_10,plain,
graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ g2 @ ( sSA_CF551432799de_val @ alpha_n @ defs @ phis @ g2 @ r ) @ rs @ pred_phi_r,
inference(split_conjunct,[status(thm)],[fact_4_rs_H__props_I1_J]) ).
thf(c_0_11,plain,
! [X2918: g,X2919: list_node] :
( ~ ( graph_1994935542_edgeD @ alpha_n @ invar @ inEdges @ entry @ X2918 @ X2919 )
| ( distinct_node @ X2919 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_5_old_OEntryPath__distinct])])]) ).
thf(c_0_12,plain,
! [X2138: list_node] :
( ~ ( distinct_node @ X2138 )
| ~ ( member_node @ ( hd_node @ X2138 ) @ ( set_node2 @ ( tl_node @ X2138 ) ) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])]) ).
thf(c_0_13,negated_conjecture,
member_node @ ( sSA_CF551432799de_val @ alpha_n @ defs @ phis @ g2 @ r ) @ ( set_node2 @ ( tl_node @ rs ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_14,plain,
( ( sSA_CF551432799de_val @ alpha_n @ defs @ phis @ g2 @ r )
= ( hd_node @ rs ) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
thf(c_0_15,plain,
! [X1: g,X3: list_node] :
( ( distinct_node @ X3 )
| ~ ( graph_1994935542_edgeD @ alpha_n @ invar @ inEdges @ entry @ X1 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
thf(c_0_16,plain,
graph_1994935542_edgeD @ alpha_n @ invar @ inEdges @ entry @ g2 @ rs,
inference(split_conjunct,[status(thm)],[fact_3_rs_H__props_I2_J]) ).
thf(c_0_17,plain,
! [X3: list_node] :
( ~ ( distinct_node @ X3 )
| ~ ( member_node @ ( hd_node @ X3 ) @ ( set_node2 @ ( tl_node @ X3 ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
thf(c_0_18,negated_conjecture,
member_node @ ( hd_node @ rs ) @ ( set_node2 @ ( tl_node @ rs ) ),
inference(rw,[status(thm)],[c_0_13,c_0_14]) ).
thf(c_0_19,plain,
distinct_node @ rs,
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
thf(c_0_20,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.18 % Problem : ITP080^1 : TPTP v8.1.2. Released v7.5.0.
% 0.12/0.20 % Command : run_E %s %d THM
% 0.19/0.41 % Computer : n025.cluster.edu
% 0.19/0.41 % Model : x86_64 x86_64
% 0.19/0.41 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.41 % Memory : 8042.1875MB
% 0.19/0.41 % OS : Linux 3.10.0-693.el7.x86_64
% 0.19/0.41 % CPULimit : 300
% 0.19/0.41 % WCLimit : 300
% 0.19/0.41 % DateTime : Fri May 3 13:02:58 EDT 2024
% 0.19/0.41 % CPUTime :
% 0.38/0.60 Running higher-order theorem proving
% 0.38/0.60 Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.mOZHZfEMMT/E---3.1_20101.p
% 0.45/0.80 # Version: 3.1.0-ho
% 0.45/0.80 # Preprocessing class: HSLSSMSMSSMNHSA.
% 0.45/0.80 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.45/0.80 # Starting ehoh_best2 with 1500s (5) cores
% 0.45/0.80 # Starting additional_ho_6 with 300s (1) cores
% 0.45/0.80 # Starting new_bool_5 with 300s (1) cores
% 0.45/0.80 # Starting new_bool_1 with 300s (1) cores
% 0.45/0.80 # additional_ho_6 with pid 20181 completed with status 0
% 0.45/0.80 # Result found by additional_ho_6
% 0.45/0.80 # Preprocessing class: HSLSSMSMSSMNHSA.
% 0.45/0.80 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.45/0.80 # Starting ehoh_best2 with 1500s (5) cores
% 0.45/0.80 # Starting additional_ho_6 with 300s (1) cores
% 0.45/0.80 # SinE strategy is GSinE(CountFormulas,hypos,4.0,,2,20000,1.0)
% 0.45/0.80 # Search class: HGHSM-FSLM31-DHSFFSBN
% 0.45/0.80 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.45/0.80 # Starting ehoh_best2 with 163s (1) cores
% 0.45/0.80 # ehoh_best2 with pid 20186 completed with status 0
% 0.45/0.80 # Result found by ehoh_best2
% 0.45/0.80 # Preprocessing class: HSLSSMSMSSMNHSA.
% 0.45/0.80 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.45/0.80 # Starting ehoh_best2 with 1500s (5) cores
% 0.45/0.80 # Starting additional_ho_6 with 300s (1) cores
% 0.45/0.80 # SinE strategy is GSinE(CountFormulas,hypos,4.0,,2,20000,1.0)
% 0.45/0.80 # Search class: HGHSM-FSLM31-DHSFFSBN
% 0.45/0.80 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.45/0.80 # Starting ehoh_best2 with 163s (1) cores
% 0.45/0.80 # Preprocessing time : 0.008 s
% 0.45/0.80
% 0.45/0.80 # Proof found!
% 0.45/0.80 # SZS status Theorem
% 0.45/0.80 # SZS output start CNFRefutation
% See solution above
% 0.45/0.80 # Parsed axioms : 432
% 0.45/0.80 # Removed by relevancy pruning/SinE : 185
% 0.45/0.80 # Initial clauses : 594
% 0.45/0.80 # Removed in clause preprocessing : 16
% 0.45/0.80 # Initial clauses in saturation : 578
% 0.45/0.80 # Processed clauses : 601
% 0.45/0.80 # ...of these trivial : 13
% 0.45/0.80 # ...subsumed : 47
% 0.45/0.80 # ...remaining for further processing : 541
% 0.45/0.80 # Other redundant clauses eliminated : 954
% 0.45/0.80 # Clauses deleted for lack of memory : 0
% 0.45/0.80 # Backward-subsumed : 0
% 0.45/0.80 # Backward-rewritten : 5
% 0.45/0.80 # Generated clauses : 3963
% 0.45/0.80 # ...of the previous two non-redundant : 2911
% 0.45/0.80 # ...aggressively subsumed : 0
% 0.45/0.80 # Contextual simplify-reflections : 3
% 0.45/0.80 # Paramodulations : 3000
% 0.45/0.80 # Factorizations : 0
% 0.45/0.80 # NegExts : 0
% 0.45/0.80 # Equation resolutions : 982
% 0.45/0.80 # Disequality decompositions : 0
% 0.45/0.80 # Total rewrite steps : 364
% 0.45/0.80 # ...of those cached : 258
% 0.45/0.80 # Propositional unsat checks : 0
% 0.45/0.80 # Propositional check models : 0
% 0.45/0.80 # Propositional check unsatisfiable : 0
% 0.45/0.80 # Propositional clauses : 0
% 0.45/0.80 # Propositional clauses after purity: 0
% 0.45/0.80 # Propositional unsat core size : 0
% 0.45/0.80 # Propositional preprocessing time : 0.000
% 0.45/0.80 # Propositional encoding time : 0.000
% 0.45/0.80 # Propositional solver time : 0.000
% 0.45/0.80 # Success case prop preproc time : 0.000
% 0.45/0.80 # Success case prop encoding time : 0.000
% 0.45/0.80 # Success case prop solver time : 0.000
% 0.45/0.80 # Current number of processed clauses : 454
% 0.45/0.80 # Positive orientable unit clauses : 36
% 0.45/0.80 # Positive unorientable unit clauses: 0
% 0.45/0.80 # Negative unit clauses : 9
% 0.45/0.80 # Non-unit-clauses : 409
% 0.45/0.80 # Current number of unprocessed clauses: 2844
% 0.45/0.80 # ...number of literals in the above : 9559
% 0.45/0.80 # Current number of archived formulas : 0
% 0.45/0.80 # Current number of archived clauses : 5
% 0.45/0.80 # Clause-clause subsumption calls (NU) : 36735
% 0.45/0.80 # Rec. Clause-clause subsumption calls : 6608
% 0.45/0.80 # Non-unit clause-clause subsumptions : 47
% 0.45/0.80 # Unit Clause-clause subsumption calls : 1498
% 0.45/0.80 # Rewrite failures with RHS unbound : 0
% 0.45/0.80 # BW rewrite match attempts : 11
% 0.45/0.80 # BW rewrite match successes : 1
% 0.45/0.80 # Condensation attempts : 0
% 0.45/0.80 # Condensation successes : 0
% 0.45/0.80 # Termbank termtop insertions : 143451
% 0.45/0.80 # Search garbage collected termcells : 19575
% 0.45/0.80
% 0.45/0.80 # -------------------------------------------------
% 0.45/0.80 # User time : 0.150 s
% 0.45/0.80 # System time : 0.008 s
% 0.45/0.80 # Total time : 0.158 s
% 0.45/0.80 # Maximum resident set size: 5552 pages
% 0.45/0.80
% 0.45/0.80 # -------------------------------------------------
% 0.45/0.80 # User time : 0.167 s
% 0.45/0.80 # System time : 0.013 s
% 0.45/0.80 # Total time : 0.180 s
% 0.45/0.80 # Maximum resident set size: 2928 pages
% 0.45/0.80 % E---3.1 exiting
% 0.45/0.80 % E exiting
%------------------------------------------------------------------------------